Random walks on networks with preferential cumulative damage: generation of bias and aging
نویسندگان
چکیده
In this paper, we explore the reduction of functionality in a complex system as consequence cumulative random damage and imperfect reparation, phenomenon modeled dynamical process on networks. We analyze global characteristics diffusive movement walkers networks where hop considering capacity transport each link. The links are susceptible to that generates bias aging. describe algorithm for generation producing eigenvalues transition matrix defines walker different types graphs, including regular, deterministic, evolution asymmetry is quantified with local information further non-local associated scale such mean first passage times fractional Laplacian matrix. Our findings suggest systems greater complexity live longer.
منابع مشابه
Random walks on networks: cumulative distribution of cover time.
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a complete graph, a cycle graph, and a path graph. An accurate approximation for the cover time distribution, with computational complexity of O(2n) , is also present...
متن کاملMaximum Consistency Preferential Random Walks
Random walk plays a significant role in computer science. The popular PageRank algorithm uses random walk. Personalized random walks force random walk to “personalized views” of the graph according to users’ preferences. In this paper, we show the close relations between different preferential random walks and label propagation methods used in semi-supervised learning. We further present a maxi...
متن کاملAging Random Walks
Aging refers to the property of two-time correlation functions to decay very slowly on (at least) two time scales. This phenomenon has gained recent attention due to experimental observations of the history dependent relaxation behavior in amorphous materials (“Glasses”) which pose a challenge to theorist. Aging signals the breaking of time-translational invariance and the violation of the fluc...
متن کاملRandom walks on temporal networks.
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various time scales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis of the temporal patterns characterizing dynamic networks are still recent, so that many questions remain open. Here, we study how random walks, as a paradigm...
متن کاملRandom Walks on Multiplex Networks
Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this letter, we extend well-known random walks to multiplexes and we introduce a new type of walk that can exist only in multiplexes. We derive exact expressions for vertex occupation time and the coverage. Finally, we show how the efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2021
ISSN: ['1742-5468']
DOI: https://doi.org/10.1088/1742-5468/abfcb5